The small octagon with longest perimeter

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Small molecule perimeter defense in entomopathogenic bacteria.

Two gram-negative insect pathogens, Xenorhabdus nematophila and Photorhabdus luminescens, produce rhabduscin, an amidoglycosyl- and vinyl-isonitrile-functionalized tyrosine derivative. Heterologous expression of the rhabduscin pathway in Escherichia coli, precursor-directed biosynthesis of rhabduscin analogs, biochemical assays, and visualization using both stimulated Raman scattering and confo...

متن کامل

Partitioning a rectangle into small perimeter rectangles

Alon, N. and D.J. Kleitman, Partitioning a rectangle into small perimeter rectangles, Discrete Mathematics 103 (1992) 111-119. We show that the way to partition a unit square into kZ + s rectangles, for s = 1 or s = -1, so as to minimize the largest perimeter of the rectangles, is to have k 1 rows of k identical rectangles and one row of k + s identical rectangles, with all rectangles having th...

متن کامل

Covering a Square by Small Perimeter Rectangles

We show that if the unit square is covered by n rectangles, then at least one must have perimeter at least 4(2m + 1)/(n + m(m + 1)), where m is the largest integer whose square is at most n. This result is exact for n of the form m(m + 1) (or m2).

متن کامل

Meshing the hyperbolic octagon

This short report describes a preliminary study of a method computing meshes of the standard hyperbolic octagon that respects its symmetries. A prototype software was written, using the 2D meshing package of the CGAL library [1, 10] and a software computing hyperbolic triangulations, currently under development [4]. Key-words: Hyperbolic geometry, Poincaré disk, Schwarz triangle, mesh ∗ This wo...

متن کامل

The Octagon Abstract Domain

This article presents the octagon abstract domain, a relational numerical abstract domain for static analysis by abstract interpretation. It allows representing conjunctions of constraints of the form ±X ± Y ≤ c where X and Y range among program variables and c is a constant in Z, Q, or R automatically inferred. Abstract elements are represented using modified Difference Bound Matrices and we u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2007

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2006.04.002